On the study of Rainbow Antimagic Connection Number of Corona Product of Graphs

Given that a graph G = (V, E). By an edge-antimagic vertex labeling of graph, we mean assigning labels on each under the label function f : V → {1, 2, . , |V (G)|} such associated weight edge uv ∈ E(G), namely w(xy) f(x) + f(y), has distinct weight. A path P in vertex-labeled is said to be rainbow if for every two edges xy, x′y ′ E(P) satisfies ̸= w(x ′y ). The called antimagic vertices x and y G, there exists − path. When assign xy with color w(xy), thus say admits coloring. connection number denoted by rac(G), smallest colors induced from all labeling. In this paper, will study rac(G) corona product graphs. graphs H, ⊙ obtained taking copy n copies H1, H2, ..., Hn, then connecting vi Hi i 1, 3, n. show exact value Tn Sm where {Pn, Sn, Sn,p, Fn,3}.